A polynomial algorithm for constructing the clique graph of a line graph

On the Roots of Hosoya Polynomial of a Graph

Let G = (V, E) be a simple graph. Hosoya polynomial of G is d(u,v) H(G, x) = {u,v}V(G)x , where, d(u ,v) denotes the distance between vertices u and v. As is the case with other graph polynomials, such as chromatic, independence and domination polynomial, it is natural to study the roots of Hosoya polynomial of a graph. In this paper we study the roots of Hosoya polynomials of some specific g...

On Szeged Polynomial of a Graph

A practical algorithm for [r, s, t]-coloring of graph

Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...

A Polynomial Time Algorithm for Graph Isomorphism

Algorithms testing two graphs for isomorphism known as yet in computer science have exponential worst case complexity. In this paper we propose an algorithm that has polynomial complexity and constructively supplies the evidence that the graph isomorphism lies in P.

An algorithm for finding a maximum clique in a graph

This paper introduces a branch and bound algorithm for the maximumclique problem which applies existing clique nding and vertex coloring heuristics to determine lower and upper bounds for the size of a maximum clique. Computational results on a variety of graphs indicate the proposed procedure in most instances outperforms leading algorithms. and an anonymous referee for their helpful discussio...